Compact Grid Representation of Graphs

نویسندگان

  • José Cáceres
  • Carmen Cortés
  • Clara I. Grima
  • Masahiro Hachimori
  • Alberto Márquez
  • Raiji Mukae
  • Atsuhiro Nakamoto
  • Seiya Negami
  • Rafael Robles
  • Jesus Valenzuela
چکیده

A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly embeddable in the grid if it is grid locatable and the segments representing edges do not cross each other. We study the area needed to obtain those representations for some graph families.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A More Compact Visibility Representation

16 4-block tree in linear time. The problem is already linear time solvable in case of 2-and 3-connected components (see e.g., Hopcroft & Tarjan 8]), hence solving this open problem yields a nice generalization. As a last subject we consider the method of triangulating planar graphs. It would be interesting to triangulate G such that it is 4-connected. Indeed, G may have separating triangles, i...

متن کامل

The study of relation between existence of admissible vectors and amenability and compactness of a locally compact group

The existence of admissible vectors for a locally compact group is closely related to the group's profile. In the compact groups, according to Peter-weyl theorem, every irreducible representation has admissible vector. In this paper, the conditions under which the inverse of this case is being investigated has been investigated. Conditions such as views that are admissible and stable will get c...

متن کامل

On independent domination numbers of grid and toroidal grid directed graphs

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

متن کامل

A Class of compact operators on homogeneous spaces

Let  $varpi$ be a representation of the homogeneous space $G/H$, where $G$ be a locally compact group and  $H$ be a compact subgroup of $G$. For  an admissible wavelet $zeta$ for $varpi$  and $psi in L^p(G/H), 1leq p <infty$, we determine a class of bounded  compact operators  which are related to continuous wavelet transforms on homogeneous spaces and they are called localization operators.

متن کامل

On grid intersection graphs

Hartman I.B.-A., I. Newman and R. Ziv, On grid intersection graphs, Discrete Mathematics 87 (1991) 41-52. A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, y,) E E if and only if segments x, and y, intersect. We prove that all planar bipartite graphs have a grid representation, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011